Asymmetric Key-Value Split Pattern Assumption over MapReduce Behavioral Model
نویسندگان
چکیده
Actual Quantifiability is a concept in MapReduce that is based on two assumptions: (1) every mapper is cautious, i. e. , does not exclude any reducer's key-value split pattern choice from consideration, and (2) every mapper respects the reducer's key-value split pattern preferences, i. e. , deems one reducer's key-value split pattern choice to be infinitely more likely than another whenever it premises the reducer to prefer the one to the other. In this paper we provide a new approach for actual quantifiability, by assuming that mappers have asymmetric key-value split pattern about the reducer's key-value utilities. We show that, if the uncertainty of each mapper about the reducer's key-value utilities vanishes gradually in some regular manner, then the key-value split pattern choices it can quantifiably make under common conjecture in quantifiability are all actually quantifiable in the original MapReduce with no uncertainty about the reducer's utilities.
منابع مشابه
Transactional Support in MapReduce for Speculative Parallelism
MapReduce has emerged as a popular programming model for large-scale distributed computing. Its framework enforces strict synchronization between successive map and reduce phases and limited data-sharing within a phase. Use of keyvalue based persistent storage with MapReduce presents intriguing opportunities and challenges. These challenges relate primarily to semantic inconsistencies arising f...
متن کاملOptimizing MapReduce for Highly Distributed Environments
MapReduce, the popular programming paradigm for large-scale data processing, has traditionally been deployed over tightly-coupled clusters where the data is already locally available. The assumption that the data and compute resources are available in a single central location, however, no longer holds for many emerging applications in commercial, scientific and social networking domains, where...
متن کاملModel Reduction With MapReduce-enabled Tall and Skinny Singular Value Decomposition
We present a method for computing reduced-order models of parameterized partial differential equation solutions. The key analytical tool is the singular value expansion of the parameterized solution, which we approximate with a singular value decomposition of a parameter snapshot matrix. To evaluate the reduced-order model at a new parameter, we interpolate a subset of the right singular vector...
متن کاملEPiC: Efficient Privacy-Preserving Counting for MapReduce
In the face of an untrusted cloud infrastructure, outsourced data needs to be protected. We present EPiC, a practical protocol for the privacy-preserving evaluation of a fundamental operation on data sets: frequency counting. In an encrypted outsourced data set, a cloud user can specify a pattern, and the cloud will count the number of occurrences of this pattern in an oblivious manner. A patte...
متن کاملA MapReduce based distributed SVM algorithm for binary classification
Although Support Vector Machine (SVM) algorithm has a high generalization property to classify for unseen examples after training phase and it has small loss value, the algorithm is not suitable for real-life classification and regression problems. SVMs cannot solve hundreds of thousands examples in training dataset. In previous studies on distributed machine learning algorithms, SVM is trained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014